Section: New Results

A Reasonable Abstract Machine for the Strong $\lambda$-Calculus

Participant : Beniamino Accattoli.

We provided a new proof that the strong $\lambda$-calculus is a reasonable computational model. The original proof is by B. Accattoli and H. Dal Lago uses a calculus with explicit substitutions while the new one relies on a new sophisticated abstract machine, the Useful MAM. The work has been published in the proceeding of the international conference WoLLIC 2016 [21].